Consequence Relations and Admissible Rules

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Consequence Relations and Admissible Rules

This paper contains a detailed account of the notion of admissibility in the setting of consequence relations. It is proved that the two notions of admissibility used in the literature coincide, and it provides an extension to multi-conclusion consequence relations that is more general than the one usually encountered in the literature on admissibility. The notion of a rule scheme is introduced...

متن کامل

Complexity of admissible rules

We investigate the computational complexity of deciding whether a given inference rule is admissible for some modal and superintuitionistic logics. We state a broad condition under which the admissibility problem is coNEXP -hard. We also show that admissibility in several well-known systems (including GL, S4, and IPC ) is in coNE , thus obtaining a sharp complexity estimate for admissibility in...

متن کامل

Judgment and consequence relations

In this paper I argue that a variety of consequence relations can be subsumed under a common core. The reduction proceeds by taking the unconditional consequence, or judgment, as basic and deriving the conditional consequence via a uniform abstraction scheme. A specific outcome is that it is better not to base such a scheme on the semantic notion of a matrix and valuation but rather on theories...

متن کامل

Proof theory for admissible rules

The admissible rules of a logic are the rules under which the set of theorems of the logic is closed. In this paper a Gentzen-style framework is introduced for defining analytic proof systems that derive the admissible rules of various non-classical logics. Just as Gentzen systems for derivability treat sequents as basic objects, for admissibility, sequent rules are basic. Proof systems are def...

متن کامل

Admissible Rules of Modal Logics

We construct explicit bases of admissible rules for a representative class of normal modal logics (including the systems K4, GL, S4, Grz, and GL.3), by extending the methods of S. Ghilardi and R. Iemhoff. We also investigate the notion of admissible multiple conclusion rules.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Philosophical Logic

سال: 2015

ISSN: 0022-3611,1573-0433

DOI: 10.1007/s10992-015-9380-8